Boltzmann Samplers for v-balanced Colored Necklaces
نویسندگان
چکیده
This paper is devoted to the random generation of particular colored necklaces for which the number of beads of a given color is constrained (these necklaces are called v-balanced). We propose an efficient sampler (its expected time complexity is linear) which satisfies the Boltzmann model principle introduced by Duchon, Flajolet, Louchard and Schaeffer (7). Our main motivation is to show that the absence of a decomposable specification can be circumvented by mixing the Boltzmann samplers with other types of samplers.
منابع مشابه
Boltzmann Samplers for Colored Combinatorial Objects
In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored objects (and also of k-colored objects) although the corresponding class cannot be described by an analytic ordinary generating function. Efficient generation ...
متن کاملBoltzmann samplers for random generation of lambda terms
Randomly generating structured objects is important in testing and optimizing functional programs, whereas generating random λ-terms is more specifically needed for testing and optimizing compilers. For that a tool called QuickCheck has been proposed, but in this tool the control of the random generation is left to the programmer. Ten years ago, a method called Boltzmann samplers has been propo...
متن کاملExact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification
Boltzmann samplers are a kind of random samplers; in 2004, Duchon, Flajolet, Louchard and Schaeffer showed that given a combinatorial class and a combinatorial specification for that class, one can automatically build a Boltzmann sampler. In this paper, we introduce a Boltzmann sampler for Motzkin trees built from a holonomic specification, that is, a specification that uses the pointing operat...
متن کاملBiased Boltzmann samplers and generation of extended linear languages with shuffle
This paper is devoted to the construction of Boltzmann samplers according to various distributions, and uses stochastic bias on the parameter of a Boltzmann sampler, to produce a sampler with a different distribution for the size of the output. As a significant application, we produce Boltzmann samplers for words defined by regular specifications containing shuffle operators and linear recursio...
متن کاملMulti-dimensional Boltzmann Sampling of context-free Languages
This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size k), while constraining every letter to a targeted frequency of occurrence. Our approach consists in an extended – multidimensional – version of the classic Boltzmann samplers [7]. We show that, under mostly strong-connectivity hypotheses, our samplers return a word of size in [(1 −...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0911.2802 شماره
صفحات -
تاریخ انتشار 2009